Time stamp based ECC encryption and decryption

Elliptic Curve Cryptography (ECC) provides a secure means of exchanging keys among communicating hosts using the diffie hellman key exchange algorithm. Encryption and decryption of texts and messages have also been attempted. In the paper on Knapsack over ECC algorithm, the authors presented the implementation of ECC by first transforming the message into an affine point on the EC, and then applying the knapsack algorithm on ECC encrypted message over the finite field GF(p). The knap sack problem is not secure in the present standards and more over in the work the authors in their decryption process used elliptic curve discrete logarithm to get back the plain text. This may form a computationally infeasible problem if the values are large enough in generating the plain text. In the present work a new mathematical model is used, which considers the output of ECC algorithm, a variable nonce value and a dynamic time stamp to generate the cipher text. Thus, by having key lengths of even less than 160 bits, the present algorithm provides sufficient strength against crypto analysis and whose performance can be compared with standard algorithms like RSA.